Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling
نویسندگان
چکیده
We address the problem of I/O scheduling of read-once reference strings in a multiple-disk parallel I/O system.We present a novel online algorithm, Red-Black Prefetching (RBP), for parallel I/O scheduling. In order to perform accurate prefetching RBP uses L-block lookahead. The performance of RBP is analyzed in the standard parallel disk model with D independent disks and a shared I/O bu er of size M . We show that the number of parallel I/Os performed by RBP is within a factot (maxf p MD=L;Dg) of the number of I/Os done by the optimal o line algorithm. This ratio is within a canstant factor of the best possible when L is L = O(MD).
منابع مشابه
An improved parallel disk scheduling algorithm
We address the problems of prefetching and I/O scheduling for read-once reference strings in a parallel I/O system. Read-once reference strings, in which each block is accessed exactly once, arise naturally in applications like databases and video retrieval. Using the standard parallel disk model with D disks and a shared I/O buffer of size M , we present a novel algorithm, Red-Black Prefetchin...
متن کاملASP: Adaptive online parallel disk scheduling
In this work we address the problems of prefetchingand I/O scheduling for read-once reference strings in a parallel I/O system. We use the standard parallel disk model withD disks a shared I/O bu er of sizeM . We design an on-line algorithm ASP (Adaptive Segmented Prefetching) with ML-block lookahead, L 1, and compare its performance to the best on-line algorithm with the same lookahead. We sho...
متن کاملPC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems
We address the problem of prefetching and caching in a parallel I/O system and present a new algorithm for parallel disk scheduling. Traditional buffer management algorithms that minimize the number of block misses are substantially suboptimal in a parallel I/O system where multiple I/Os can proceed simultaneously. We show that in the offline case, where a priori knowledge of all the requests i...
متن کاملMinimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching and caching can also be formulated as a min-cost multicommodity flow problem and, exploiting special properties of our network, can be solved using combinatorial techniques. Moreover, for parallel disk systems, we de...
متن کاملImplementation and Performance of Integrated Application-Controlled Caching, Prefetching and Disk Scheduling
Although le caching and prefetching are known techniques to improve the performance of le systems, little work has been done on intergrating caching and prefetching. Optimal prefetching is nontrivial because prefetching may require early cache block replacements. Moreover, the tradeo between the latency-hiding bene ts of prefetching and the increase in the number of fetches required must be con...
متن کامل